Routing and Wavelength Assignment in All-Optical Networks

نویسنده

  • Rajiv Ramaswami
چکیده

Abstracf— This paper considers the problem of routing connections in a reeontigurable optical network using wavelength division multiplexing. Each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned d]fferent wavelengths. We derive an upper bound on the carried traffic of connections (or equivalently, a lower bound on the blocking probability) for any routing and wavelength assignment (RWA) algorithm in such a network. The bound scales with the number of wavelengths and is achieved asymptotically (when a large number of wavelengths is available) by a fixed RWA algorithm. Although computationally intensive, our bound can be used as a metric against which the performance of different RWA algorithms can be compared for networks of moderate size. We illustrate thii by comparing the performance of a simple shortest-path RWA (SP-RWA) algorithm via simulation relative to our bound. We also derive a similar bound for optical networks using dynamic wavelength converters, which are equivalent to circuit-switched telephone networks, and compam the two cases for different examples. Finatly, we quantify the amount of wavelength reuse achievable in large networks using the SP-RWA via simulation as a function of the number of wavelengths, number of edges, and number of nodes for randomly constructed networks as well as deBruijn networks. We also quantify the difference in wavelength reuse between two different optical node architectures. The results show that it is feasible to provide several all-optical connections to each node in a large network using a limited number of wavelengths. For instance, using 32 wavelengths, it is possible to provide 10 full-duplex connections to each node in a 128-node random network with average degree 4, and 5 full-duplex connections per node in a 1000-node random network with average degree 4. The results also show that wavelength converters offer a 10-40% increase in the amount of reuse achievable for our sampling of 14 networks ranging from 16 to 1000 nodes when the number of wavelengths available is small (10 or 32).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Protection Guaranteed, Quality of Transmission Aware Routing and Wavelength Assignment Algorithm for All-optical Networks

Transparent All Optical Networks carry huge traffic and any link failure can cause the loss of gigabits of data; hence protection and its guarantee becomes necessary at the time of failure. Many protection schemes were presented in the literature, but none of them speaks about protection guarantee. Also, in all optical networks, due to absence of  regeneration capabilities, the physical layer i...

متن کامل

A New Model for Optimal Routing in All–Optical Networks with Scalable Number of Wavelength Converters1

A novel approach for modeling the optimal routing and wavelength assignment problem in wavelength division multiplexed all–optical networks is proposed. It is assumed that the optical switching nodes are equipped with a limited and scalable set of wavelength converters which can be used by any subset of incoming optical–connections. The proposed model, called the interconnected–layered–graph, p...

متن کامل

Comparative Analysis of Routing and Wavelength Assignment Algorithms used in WDM Optical Networks

This study aims at highlighting the Routing and Wavelength Assignment (RWA) problems in WDM Optical networks and describes the Routing Algorithms and their performance comparison. Since routing decisions play an important role in evaluating the blocking performance of a network it is critical to choose a wavelength assignment scheme that should take into account its compatibility with the chose...

متن کامل

Practical routing and wavelength assignment algorithms for all optical networks with limited wavelength conversion

We present an Integer Linear Program based algorithm and a K shortest path based heuristic algorithm for solving the Routing and Wavelength Assignment problem in All Optical Networks with Limited Wavelength Conversion. These algortihms are executed on a random mesh National Science Foundation Network(NSFNET). Their performances are compared.

متن کامل

Multicoloring and Wavelength Assignment in WDM all-optical Networks

This paper deals with the wavelength assignment problem in WDM all-optical networks. This problem can be abstracted as a multicoloring on a weighted conflict graph. The main focus of this work is to obtain the relationship between the wavelength assignment and the multicoloring problems. We, first, establish a new result regarding multicoloring problem in which we provide a tight bound for any ...

متن کامل

New Weight Dependent Routing and Wavelength Assignment Strategy for All Optical Networks in Absence of Wavelength Converters

In wavelength division multiplexed all optical networks; lightpath establishes a connection between sending and receiving nodes bypassing the electronic processing at intermediate nodes. One of the prime objectives of Routing and Wavelength Assignment (RWA) problem is to maximize the number of connections efficiently by choosing the best routes. Although there are several algorithms available, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997